Clustering Gene Expression Data using Quad Tree based Expectation Maximization Approach
نویسندگان
چکیده
منابع مشابه
Similarity based clustering using the expectation maximization algorithm
In this paper we present a new approach for clustering data. The clustering metric used is the normalized crosscorrelation, also known as similarity, instead of the traditionally used Euclidean distance. The main advantage of this metric is that it depends on the signal shape rather than its amplitude. Under an assumption of an exponential probability model that has several desirable properties...
متن کاملGene Expression Data Clustering using a Fuzzy Link based Approach
There are many clustering algorithms for gene expression data in the literature that are robust against noise and outliers. The limitation with many of these algorithms is that they cannot identify the overlapping and intersecting clusters. This paper presents an algorithm for clustering gene expression data using the concepts of common neighbors and fuzzy clustering for detecting intersecting ...
متن کاملA Hybrid Approach for Data Clustering using Expectation- Maximization and Parameter Adaptive Harmony Search Algorithm
This paper presents a novel hybrid data clustering algorithm based on parameter adaptive harmony search algorithm. The recently developed parameter adaptive harmony search algorithm (PAHS) is used to refine the cluster centers, which are further used in initializing Expectation-Maximization clustering algorithm. The optimal number of clusters are determined through four well-known cluster valid...
متن کاملExpectation maximization approach to data-based fault diagnostics
The data-based fault detection and isolation (DBFDI) process becomes more potentially challenging if the faulty component of the system causes partial loss of data. In this paper, we present an iterative approach to DBFDI that is capable of recovering the model and detecting the fault pertaining to that particular cause of the model loss. The developedmethod is an expectation-maximization (EM) ...
متن کاملKD-Tree Based Clustering for Gene Expression Data
K-means is one of the widely researched clustering algorithms. But it is sensitive to the selection of initial cluster centers and estimation of the number of clusters. In this chapter, we propose a novel approach to find the efficient initial cluster centers using kd-tree and compute the number of clusters using joint distance function. We have carried out excessive experiments on various synt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2012
ISSN: 2249-0868
DOI: 10.5120/ijais12-450399